Learning Finite-State Machines from Inexperienced TeachersGRINCHTEIN, Olga; LEUCKER, Martin.Lecture notes in computer science. 2006, pp 344-345, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 2 p.Conference Paper

Protocol validation by maximal progress state explorationGOUDA, M. G; YU, Y. T.IEEE transactions on communications. 1984, Vol 32, Num 1, pp 94-97, issn 0090-6778Article

Symbolic cover minimization of fully I/O specified finite state machinesDRUSINSKY-YORESH, D.IEEE transactions on computer-aided design of integrated circuits and systems. 1990, Vol 9, Num 7, pp 779-781, issn 0278-0070, 3 p.Article

A simple protocol whose proof isn'tHAILPERN, B.IEEE transactions on communications. 1985, Vol 33, Num 4, pp 330-337, issn 0090-6778Article

A distributed alternative to finite-state-machine specificationsZAVE, P.ACM transactions on programming languages and systems. 1985, Vol 7, Num 1, pp 10-36, issn 0164-0925Article

Synthesis of communicating finite state machines with guaranteed progressGOUDA, M. G; YAO-TIN YU.IEEE transactions on communications. 1984, Vol 32, Num 7, pp 779-789, issn 0090-6778Article

On «a simple protocol whose proof isn't»: the state machine approachGOUDA, M. G.IEEE transactions on communications. 1985, Vol 33, Num 4, pp 380-382, issn 0090-6778Article

Exact solutions for the construction of optimal length test sequencesRODRIGUES, M; URAL, H.Information processing letters. 1993, Vol 48, Num 6, pp 275-280, issn 0020-0190Article

Closed covers: to verify progress for communicating finite state machinesGOUDA, M. G.IEEE transactions on software engineering. 1984, Vol 10, Num 6, pp 846-855, issn 0098-5589Article

A method for improving string pattern matching machinesAOE, J; YAMAMOTO, Y; SHIMADA, R et al.IEEE transactions on software engineering. 1984, Vol 10, Num 1, pp 116-120, issn 0098-5589Article

Memory requirements of first-order digital filtersBILARDI, G; PREPARATA, F. P.IEEE Transactions on circuits and systems. II : Analog and digital signal processing. 1992, Vol 39, Num 6, pp 348-355Article

A solftware function test design using state transition diagramMASUYAMA, H.Systems, computers, controls. 1984, Vol 15, Num 1, pp 11-19, issn 0096-8765Article

p-subsequentiable transducersALLAUZEN, Cyril; MOHRI, Mehryar.Lecture notes in computer science. 2003, pp 24-34, issn 0302-9743, isbn 3-540-40391-4, 11 p.Conference Paper

Infinite-state high-level MCS: Model-checking and realizability: (Extended abstract)GENEST, Blaise; MUSCHOLL, Anca; SEIDL, Helmut et al.Lecture notes in computer science. 2002, pp 657-668, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Evaluating two-bit branch predictors for user/kernel codePETROVIC, M; TARTALJA, I.International conference on microelectronic. 1997, pp 827-830, isbn 0-7803-3664-X, 2VolConference Paper

Deduction on the compositions of finite-state modelsNOVORUSSKY, V.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 156-160, isbn 2-9502908-5-X, 2VolConference Paper

Some results on the design of regular structural sequential circuitsGRASS, W.Integration (Amsterdam). 1985, Vol 3, Num 3, pp 189-210, issn 0167-9260Article

Proving liveness for networks of communicating finite state machinesGOUDA, M. G; CHUNG-KUO CHANG.ACM transactions on programming languages and systems. 1986, Vol 8, Num 1, pp 154-182, issn 0164-0925Article

From xerox to aspell : A first prototype of a north sámi speller based on TWOL technologyGAUP, Børre; MOSHAGEN, Sjur; OMMA, Thomas et al.Lecture notes in computer science. 2006, pp 306-307, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 2 p.Conference Paper

Thompson digraphs: A characterizationGIAMMARRESI, Dora; PONTY, Jean-Luc; WOOD, Derick et al.Lecture notes in computer science. 2001, pp 91-100, issn 0302-9743, isbn 3-540-42812-7Conference Paper

Deriving deadlock and unspecified reception free protocol converters from message mapping setsPEYRAVIAN, M; LEA, C.-T.Computer networks and ISDN systems. 1996, Vol 28, Num 13, pp 1831-1844, issn 0169-7552Article

A Merging States Algorithm for Inference of RFSAsALVAREZ, Gloria; GARCIA, Pedro; RUIZ, José et al.Lecture notes in computer science. 2006, pp 340-341, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 2 p.Conference Paper

Closing the gap between software modelling and codeWAGNER, F; WAGNER, T; WOLSTENHOLME, P et al.IEEE international conference and workshop on the engineering of computer-based systems. 2004, pp 52-59, isbn 0-7695-2125-8, 1Vol, 8 p.Conference Paper

Testing from a finite-state machine : Extending invertibility to sequencesHIERONS, R. M.Computer journal (Print). 1997, Vol 40, Num 4, pp 220-230, issn 0010-4620Article

Finite-state methods and natural language processing (5th international workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005)Yli-Jyrä, Anssi; Karttunen, Lauri; Karhumäki, Juhani et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, XIV-312 p, isbn 978-3-540-35467-3Conference Proceedings